The Disjoint m-Flower Intersection Problem for Latin Squares
نویسندگان
چکیده
An m-flower in a latin square is a set of m entries which share either a common row, a common column, or a common symbol, but which are otherwise distinct. Two m-flowers are disjoint if they share no common row, column or entry. In this paper we give a solution of the intersection problem for disjoint m-flowers in latin squares; that is, we determine precisely for which triples (n,m, x) there exists a pair of latin squares of order n whose intersection consists exactly of x disjoint m-flowers.
منابع مشابه
The four-way intersection problem for latin squares
For μ given latin squares of order n, they have k intersection when they have k identical cells and n − k cells with mutually different entries. For each n ≥ 1 the set of integers k such that there exist μ latin squares of order n with k intersection is denoted by I[n]. In a paper by P. Adams et al. (2002), I[n] is determined completely. In this paper we completely determine I[n] for n ≥ 16. Fo...
متن کاملQuasi-embeddings and intersections of latin squares of different orders
We consider a common generalization of the embedding and intersection problems for latin squares. Specifically, we extend the definition of embedding to squares whose sides do not meet the necessary condition for embedding and extend the intersection problem to squares of different orders. Results are given for arbitrary latin squares, and those which are idempotent and idempotent symmetric. Th...
متن کاملOn the existence of certain SOLS with Holes
We consider a pair of MOLS (mutually orthogonal Latin squares) having holes, corresponding to missing sub-MOLS, which are disjoint and spanning. If the two squares are mutual transposes, we say that we have SOLS (self-orthogonal Latin squares) with holes. It is shown that a pair of SOLS with n holes of size h ≥ 2 exist if and only if n ≥ 4 and it is also shown that a pair of SOLS with n holes o...
متن کاملThe three-way intersection problem for latin squares
The set of integers k for which there exist three latin squares of order n having precisely k cells identical, with their remaining n − k cells di2erent in all three latin squares, denoted by I [n], is determined here for all orders n. In particular, it is shown that I [n] = {0; : : : ; n2−15}∪ {n2 − 12; n − 9; n2}; for n¿ 8. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملIndivisible partitions of latin squares
In a latin square of order n, a k-plex is a selection of kn entries in which each row, column and symbol occurs k times. A 1-plex is also called a transversal. An indivisible k-plex is one that contains no c-plex for 0ocok. For orders n= 2f2,6g, existence of latin squares with a partition into 1-plexes was famously shown in 1960 by Bose, Shrikhande and Parker. A main result of this paper is tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011